Non-Disjoint Unions of Theories and Combinations of Satis ability Procedures: First Results
نویسندگان
چکیده
In this paper we outline a theoretical framework for the combination of decision procedures for the satis ability of constraints with respect to a constraint theory. We describe a general combination method which, given a procedure that decides constraint satis ability with respect to a constraint theory T1 and one that decides constraint satis ability with respect to a constraint theory T2, is able to produce a procedure that (semi-)decides constraint satis ability with respect to the union of T1 and T2. We also provide some model-theoretic conditions on the constraint language and the component constraint theories for the method to be sound and complete, with special emphasis on the case in which the signatures of T1 and T2 are non-disjoint.
منابع مشابه
Examples of non-quasicommutative semigroups decomposed into unions of groups
Decomposability of an algebraic structure into the union of its sub-structures goes back to G. Scorza's Theorem of 1926 for groups. An analogue of this theorem for rings has been recently studied by A. Lucchini in 2012. On the study of this problem for non-group semigroups, the first attempt is due to Clifford's work of 1961 for the regular semigroups. Since then, N.P. Mukherjee in 1972 studied...
متن کاملCanonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the disjoint union of the two theories? We prove this is possible whenever the original theories are convex. As an application, we prove that algorithms for solving equations in the two theories (solvers) cannot be combine...
متن کاملA Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited
The Nelson-Oppen combination method is ubiquitous in Satisfiability Modulo Theories solvers. However, one of its major drawbacks is to be restricted to disjoint unions of theories. We investigate the problem of extending this combination method to particular non-disjoint unions of theories connected via bridging functions. The motivation is, e.g., to solve verification problems expressed in a c...
متن کاملModular Termination and Combinability for Superposition Modulo Counter Arithmetic
Modularity is a highly desirable property in the development of satisfiability procedures. In this paper we are interested in using a dedicated superposition calculus to develop satisfiability procedures for (unions of) theories sharing counter arithmetic. In the first place, we are concerned with the termination of this calculus for theories representing data structures and their extensions. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998